The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor

نویسندگان

چکیده

We prove that for every integer $k$, there exists $\varepsilon > 0$ such n-vertex graph $G$ with no pivot-minor isomorphic to $C_k$, exist disjoint sets $A,B \subseteq V(G)$ $|A|,|B| \geq \varepsilon n$, and $A$ is either complete or anticomplete $B$. This proves the analog of Erd\H{o}s-Hajnal conjecture class graphs $C_k$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs with no K3,3 Minor Containing a Fixed Edge

It is well known that every cycle of a graph must intersect every cut in an even number of edges. For planar graphs, Ford and Fulkerson proved that, for any edge e, there exists a cycle containing e that intersects every minimal cut containing e in exactly two edges. The main result of this paper generalizes this result to any nonplanar graph G provided G does not have a K 3,3 minor containing ...

متن کامل

The Erdős-Hajnal conjecture for rainbow triangles

We prove that every 3-coloring of the edges of the complete graph on n vertices without a rainbow triangle contains a set of order Ω ( n log n ) which uses at most two colors, and this bound is tight up to a constant factor. This verifies a conjecture of Hajnal which is a case of the multicolor generalization of the well-known Erdős-Hajnal conjecture. We further establish a generalization of th...

متن کامل

Even-cycle decompositions of graphs with no odd-K4-minor

An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981) proved that every 2-connected loopless Eulerian planar graph with an even number of edges also admits an even-cycle decomposition. Later, Zhang (1994) generalized this to graphs with no K5-minor. Our main theorem gi...

متن کامل

Towards Erdős-Hajnal for graphs with no 5-hole

The Erdős-Hajnal conjecture says that for every graph H there exists c > 0 such that max(α(G), ω(G)) ≥ n for every H-free graph G with n vertices, and this is still open when H = C5. Until now the best bound known on max(α(G), ω(G)) for C5-free graphs was the general bound of Erdős and Hajnal, that for all H, max(α(G), ω(G)) ≥ 2 √ logn) if G is H-free. We improve this when H = C5 to max(α(G), ω...

متن کامل

Graphs with no P̄7-minor

Let P̄7 denote the complement of a path on seven vertices. We determine all 4-connected graphs that do not contain P̄7 as a minor.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2021

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/9536